Proving WAM compiler correctness

In this note we analyse the proof of compiler correctness of the WAM given in the paper The WAM - Definition and Compiler Correctness by Egon Boerger and Dean Rosenzweig. TR-14/92, Dipartimento di Informatica, Universita di Pisa, 1992. with regard to the question how it could be assisted by an automated theorem prover. We will give further details of the proof methodology and present the proof obligations in a form that is amenable to automated deduction systems

Model Checking for Energy Efficient Scheduling in Wireless Sensor Networks

Networking and power management of wireless energy - conscious sensor networks is an important area of current research. We investigate a network of MicaZ sensor motes using the ZigBee protocol for communication, and provide a model using Timed Safety Automata. Our analysis focuses on estimating energy consumption by model checking in different scenarios using the Uppaal tool. Special interest is devoted to the energy use in marginal situations that rarely occur and consequently might not be seen doing simulation

Implementing semantic tableaux

This report describes implementions of the tableau calculus for first-order logic. First an extremely simple implementation, called leanTAP, is presented, which nonetheless covers the full functionality of the calculus and is also competitive with respect to performance. A second approach uses compilation techniques for proof search. Improvements inculding universal variables and lemmata are considered as well as more efficient data structures using reduced ordered binary decision diagrams. The implementation language is PROLOG. In all cases fully operational PROLOG code is given. For leanTAP a formal proof of the correctness of the implementation is given relying on the operational semantics of PROLOG as given by the SLD-tree model. This report will appear as a chapter in the Handbook of Tableau-based Methods in Automated Deduction edited by: D. Gabbay, M. D\u27Agostino, R. H\"{a}hnle, and J.Posegga published by: KLUWER ACADEMIC PUBLISHERS Electronic availability will be discontinued after final acceptance for publication is obtained

A First-Order Theory of Ordinals

This technical report documents the work done leading up to a paper on a theory of ordinal submitted to the Tableaux 2017 conference

Some Notes on Permutations

This note states and proves a theorem on permutations that solves a problem that turned up during the verification of a Java program implementing the dual pivot quicksort algorithm

Logik in der Informatik. 3. Jahrestagung der GI-Fachgruppe 0.1.6

In diesem Internen Bericht der Fakultaet fuer Informatik der Universitaet Karlsruhe sind die Zusammenfassungen der Vortraege enthalten, die auf der dritten Arbeitstagung der GI-Fachgruppe 0.1.6 "Logik in der Informatik" gehalten wurden. Nach dem konstituierenden Treffen der Fachgruppe 1993 in Leipzig, dem Treffen 1994 in Paderborn fand 1995 die Arbeitstagung vom 31.5. bis 2.6. in Karlsruhe statt. pdf-conversio

Takeuti\u27s First-Order Theory of Ordinals Revisited

These notes contain technical details that could not be fitted into the paper submitted to IJCAR 2018. The conference submission analyses the relationship between Takeuti’s theory of ordinals published in [6] and my theory in the paper [5]